Analysis of Checkpointing Schemes with Task Duplication

نویسندگان

  • Avi Ziv
  • Jehoshua Bruck
چکیده

This paper suggests a technique for analyzing the performance of checkpointing schemes with task duplication. We show how this technique can be used to derive the average execution time of a task and other important parameters related to the performance of checkpointing schemes. The analysis results are used to study and compare the performance of four existing checkpointing schemes. Our comparison results show that, in general, the number of processors used, not the complexity of the scheme, has the most effect on the scheme performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Checkpointing Schemes for Fault Tolerance in Real-Time Systems with Task Duplication

Dynamic adaptation techniques based on checkpointing is studied in this paper. Placing store-checkpoints and compare-checkpoints between CSCP (store-and-compare-checkpoint), we first present adaptive checkpointing schemes in which the checkpointing interval for a task is dynamically adjusted on line. Introducing the overheads of comparison and storage, the average execution times to complete a ...

متن کامل

Analysis of Checkpointing Schemes for Multiprocessor Systems

Parallel computing systems provide hardware redundancy that helps t o achieve low cost fault-tolerance, by duplicating the task into more than a single processor, and comparing the states of the processors a t checkpoints. This paper suggests a novel technique, based on a Markov Reward Model (MRM) , f o r analyzing the performance of checkpointing schemes with task duplication. W e show how thi...

متن کامل

Analysis of checkpointing for schedulability of real-time systems

Checkpointing is a relatively cost effective method for achieving fault tolerance in real-time systems. Since checkpointing schemes depend on time redundancy, they could affect the correctness of the system by causing deadlines to be missed. This paper provides exact schedulability tests for fault tolerant task sets under specified failure hypothesis and employing checkpointing to assist in fau...

متن کامل

A Fault – Tolerant System for Balancing the Load of Data – Parallel Applications

Abstract –– In distributed computing environments, fault–tolerance is an important objective, especially for parallel applications. Many distributed computing environments achieve fault–tolerance by periodic checkpointing. This has the advantage of relative ease of implementation and can be considered equivalent to task migration. However, there are two main disadvantages of such environments. ...

متن کامل

Green Energy-aware task scheduling using the DVFS technique in Cloud Computing

Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 47  شماره 

صفحات  -

تاریخ انتشار 1998